t = int(input())
for i in range (0,t):
n = (input())
L = [int(x) for x in n]
while len(L)>1:
index = L.index(min(L))
if(len(L)==2):
print(L[1])
break
elif(len(L)%2==0):
L[index],L[1] = L[1],L[index]
L.pop(len(L)-1)
else:
if(index!=1):
L[index],L[1] = L[1],L[index]
L.pop(len(L)-1)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define superfast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(NULL);
void solve() {
string n;
cin >> n;
if(n.size() == 2) {
cout << n[1] << endl;
}
else {
cout << *min_element(n.begin(), n.end()) << endl;
}
}
int main() {
//freopen("input.in", "rt", stdin);
//freopen("output.out", "wt", stdout);
superfast;
int t;
cin >> t;
while(t--) {
solve();
}
return 0;
}50A - Domino piling | 479A - Expression |
1480A - Yet Another String Game | 1216C - White Sheet |
1648A - Weird Sum | 427A - Police Recruits |
535A - Tavas and Nafas | 581A - Vasya the Hipster |
1537B - Bad Boy | 1406B - Maximum Product |
507B - Amr and Pins | 379A - New Year Candles |
1154A - Restoring Three Numbers | 750A - New Year and Hurry |
705A - Hulk | 492B - Vanya and Lanterns |
1374C - Move Brackets | 1476A - K-divisible Sum |
1333A - Little Artem | 432D - Prefixes and Suffixes |
486A - Calculating Function | 1373B - 01 Game |
1187A - Stickers and Toys | 313B - Ilya and Queries |
579A - Raising Bacteria | 723A - The New Year Meeting Friends |
302A - Eugeny and Array | 1638B - Odd Swap Sort |
1370C - Number Game | 1206B - Make Product Equal One |